TSTP Solution File: ITP071^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP071^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n031.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:06:51 EDT 2024

% Result   : Theorem 0.44s 0.76s
% Output   : CNFRefutation 0.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   24 (  14 unt;  10 typ;   0 def)
%            Number of atoms       :   14 (   6 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   61 (   4   ~;   0   |;   0   &;  57   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :    9 (   0   ^   9   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    produc143150363Tree_a: $tType ).

thf(decl_sort2,type,
    tree_a: $tType ).

thf(decl_sort3,type,
    a: $tType ).

thf(decl_56,type,
    heapIm837449470Leaf_a: tree_a > produc143150363Tree_a ).

thf(decl_61,type,
    e_a: tree_a ).

thf(decl_62,type,
    t_a: a > tree_a > tree_a > tree_a ).

thf(decl_64,type,
    is_heap_a: tree_a > $o ).

thf(decl_81,type,
    produc686083979Tree_a: a > tree_a > produc143150363Tree_a ).

thf(decl_120,type,
    product_snd_a_Tree_a: produc143150363Tree_a > tree_a ).

thf(decl_135,type,
    v: a ).

thf(conj_0,conjecture,
    is_heap_a @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v @ e_a @ e_a ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.JsL05sN5T3/E---3.1_23625.p',conj_0) ).

thf(fact_16_removeLeaf_Osimps_I1_J,axiom,
    ! [X11: a] :
      ( ( heapIm837449470Leaf_a @ ( t_a @ X11 @ e_a @ e_a ) )
      = ( produc686083979Tree_a @ X11 @ e_a ) ),
    file('/export/starexec/sandbox/tmp/tmp.JsL05sN5T3/E---3.1_23625.p',fact_16_removeLeaf_Osimps_I1_J) ).

thf(fact_29_snd__conv,axiom,
    ! [X32: a,X33: tree_a] :
      ( ( product_snd_a_Tree_a @ ( produc686083979Tree_a @ X32 @ X33 ) )
      = X33 ),
    file('/export/starexec/sandbox/tmp/tmp.JsL05sN5T3/E---3.1_23625.p',fact_29_snd__conv) ).

thf(fact_10_is__heap_Osimps_I1_J,axiom,
    is_heap_a @ e_a,
    file('/export/starexec/sandbox/tmp/tmp.JsL05sN5T3/E---3.1_23625.p',fact_10_is__heap_Osimps_I1_J) ).

thf(c_0_4,negated_conjecture,
    ~ ( is_heap_a @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v @ e_a @ e_a ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_5,negated_conjecture,
    ~ ( is_heap_a @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v @ e_a @ e_a ) ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_6,plain,
    ! [X1678: a] :
      ( ( heapIm837449470Leaf_a @ ( t_a @ X1678 @ e_a @ e_a ) )
      = ( produc686083979Tree_a @ X1678 @ e_a ) ),
    inference(variable_rename,[status(thm)],[fact_16_removeLeaf_Osimps_I1_J]) ).

thf(c_0_7,negated_conjecture,
    ~ ( is_heap_a @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v @ e_a @ e_a ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,plain,
    ! [X2: a] :
      ( ( heapIm837449470Leaf_a @ ( t_a @ X2 @ e_a @ e_a ) )
      = ( produc686083979Tree_a @ X2 @ e_a ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_9,plain,
    ! [X1609: a,X1610: tree_a] :
      ( ( product_snd_a_Tree_a @ ( produc686083979Tree_a @ X1609 @ X1610 ) )
      = X1610 ),
    inference(variable_rename,[status(thm)],[fact_29_snd__conv]) ).

thf(c_0_10,negated_conjecture,
    ~ ( is_heap_a @ ( product_snd_a_Tree_a @ ( produc686083979Tree_a @ v @ e_a ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_11,plain,
    ! [X2: a,X1: tree_a] :
      ( ( product_snd_a_Tree_a @ ( produc686083979Tree_a @ X2 @ X1 ) )
      = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_12,plain,
    is_heap_a @ e_a,
    inference(split_conjunct,[status(thm)],[fact_10_is__heap_Osimps_I1_J]) ).

thf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.18/0.18  % Problem    : ITP071^1 : TPTP v8.1.2. Released v7.5.0.
% 0.18/0.20  % Command    : run_E %s %d THM
% 0.19/0.41  % Computer : n031.cluster.edu
% 0.19/0.41  % Model    : x86_64 x86_64
% 0.19/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.41  % Memory   : 8042.1875MB
% 0.19/0.41  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.41  % CPULimit   : 300
% 0.19/0.41  % WCLimit    : 300
% 0.19/0.41  % DateTime   : Fri May  3 12:47:47 EDT 2024
% 0.19/0.41  % CPUTime    : 
% 0.26/0.60  Running higher-order theorem proving
% 0.26/0.60  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.JsL05sN5T3/E---3.1_23625.p
% 0.44/0.76  # Version: 3.1.0-ho
% 0.44/0.76  # Preprocessing class: HSLMSMSSSSLCHFA.
% 0.44/0.76  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.76  # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.76  # Starting sh5l with 300s (1) cores
% 0.44/0.76  # Starting lpo8_s with 300s (1) cores
% 0.44/0.76  # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.44/0.76  # sh5l with pid 23794 completed with status 0
% 0.44/0.76  # Result found by sh5l
% 0.44/0.76  # Preprocessing class: HSLMSMSSSSLCHFA.
% 0.44/0.76  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.76  # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.76  # Starting sh5l with 300s (1) cores
% 0.44/0.76  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.44/0.76  # Search class: HGUSM-FSLM31-DHFFFMBN
% 0.44/0.76  # partial match(1): HGUSM-FSLM32-DHFFFMBN
% 0.44/0.76  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.76  # Starting new_ho_10 with 181s (1) cores
% 0.44/0.76  # new_ho_10 with pid 23811 completed with status 0
% 0.44/0.76  # Result found by new_ho_10
% 0.44/0.76  # Preprocessing class: HSLMSMSSSSLCHFA.
% 0.44/0.76  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.76  # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.76  # Starting sh5l with 300s (1) cores
% 0.44/0.76  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.44/0.76  # Search class: HGUSM-FSLM31-DHFFFMBN
% 0.44/0.76  # partial match(1): HGUSM-FSLM32-DHFFFMBN
% 0.44/0.76  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.76  # Starting new_ho_10 with 181s (1) cores
% 0.44/0.76  # Preprocessing time       : 0.013 s
% 0.44/0.76  # Presaturation interreduction done
% 0.44/0.76  
% 0.44/0.76  # Proof found!
% 0.44/0.76  # SZS status Theorem
% 0.44/0.76  # SZS output start CNFRefutation
% See solution above
% 0.44/0.76  # Parsed axioms                        : 484
% 0.44/0.76  # Removed by relevancy pruning/SinE    : 223
% 0.44/0.76  # Initial clauses                      : 594
% 0.44/0.76  # Removed in clause preprocessing      : 10
% 0.44/0.76  # Initial clauses in saturation        : 584
% 0.44/0.76  # Processed clauses                    : 632
% 0.44/0.76  # ...of these trivial                  : 44
% 0.44/0.76  # ...subsumed                          : 173
% 0.44/0.76  # ...remaining for further processing  : 415
% 0.44/0.76  # Other redundant clauses eliminated   : 35
% 0.44/0.76  # Clauses deleted for lack of memory   : 0
% 0.44/0.76  # Backward-subsumed                    : 1
% 0.44/0.76  # Backward-rewritten                   : 2
% 0.44/0.76  # Generated clauses                    : 43
% 0.44/0.76  # ...of the previous two non-redundant : 30
% 0.44/0.76  # ...aggressively subsumed             : 0
% 0.44/0.76  # Contextual simplify-reflections      : 0
% 0.44/0.76  # Paramodulations                      : 4
% 0.44/0.76  # Factorizations                       : 0
% 0.44/0.76  # NegExts                              : 0
% 0.44/0.76  # Equation resolutions                 : 35
% 0.44/0.76  # Disequality decompositions           : 0
% 0.44/0.76  # Total rewrite steps                  : 130
% 0.44/0.76  # ...of those cached                   : 102
% 0.44/0.76  # Propositional unsat checks           : 0
% 0.44/0.76  #    Propositional check models        : 0
% 0.44/0.76  #    Propositional check unsatisfiable : 0
% 0.44/0.76  #    Propositional clauses             : 0
% 0.44/0.76  #    Propositional clauses after purity: 0
% 0.44/0.76  #    Propositional unsat core size     : 0
% 0.44/0.76  #    Propositional preprocessing time  : 0.000
% 0.44/0.76  #    Propositional encoding time       : 0.000
% 0.44/0.76  #    Propositional solver time         : 0.000
% 0.44/0.76  #    Success case prop preproc time    : 0.000
% 0.44/0.76  #    Success case prop encoding time   : 0.000
% 0.44/0.76  #    Success case prop solver time     : 0.000
% 0.44/0.76  # Current number of processed clauses  : 23
% 0.44/0.76  #    Positive orientable unit clauses  : 19
% 0.44/0.76  #    Positive unorientable unit clauses: 0
% 0.44/0.76  #    Negative unit clauses             : 3
% 0.44/0.76  #    Non-unit-clauses                  : 1
% 0.44/0.76  # Current number of unprocessed clauses: 336
% 0.44/0.76  # ...number of literals in the above   : 1199
% 0.44/0.76  # Current number of archived formulas  : 0
% 0.44/0.76  # Current number of archived clauses   : 357
% 0.44/0.76  # Clause-clause subsumption calls (NU) : 49987
% 0.44/0.76  # Rec. Clause-clause subsumption calls : 5366
% 0.44/0.76  # Non-unit clause-clause subsumptions  : 185
% 0.44/0.76  # Unit Clause-clause subsumption calls : 285
% 0.44/0.76  # Rewrite failures with RHS unbound    : 0
% 0.44/0.76  # BW rewrite match attempts            : 34
% 0.44/0.76  # BW rewrite match successes           : 2
% 0.44/0.76  # Condensation attempts                : 632
% 0.44/0.76  # Condensation successes               : 12
% 0.44/0.76  # Termbank termtop insertions          : 64941
% 0.44/0.76  # Search garbage collected termcells   : 11835
% 0.44/0.76  
% 0.44/0.76  # -------------------------------------------------
% 0.44/0.76  # User time                : 0.118 s
% 0.44/0.76  # System time              : 0.006 s
% 0.44/0.76  # Total time               : 0.124 s
% 0.44/0.76  # Maximum resident set size: 5100 pages
% 0.44/0.76  
% 0.44/0.76  # -------------------------------------------------
% 0.44/0.76  # User time                : 0.134 s
% 0.44/0.76  # System time              : 0.011 s
% 0.44/0.76  # Total time               : 0.144 s
% 0.44/0.76  # Maximum resident set size: 2828 pages
% 0.44/0.76  % E---3.1 exiting
% 0.44/0.76  % E exiting
%------------------------------------------------------------------------------